منابع مشابه
A Practical Voter-Verifiable Election Scheme
We present an election scheme designed to allow voters to verify that their vote is accurately included in the tabulation. The scheme provides a high degree of transparency whilst ensuring the secrecy of votes. Assurance is derived from close auditing of all the steps of the vote recording and counting process with minimal dependence on the system components. Thus, assurance arises from verific...
متن کاملThe Prêt à Voter Verifiable Election System
The Prêt à Voter election system has undergone several revisions and enhancements since its inception in 2004, resulting in a family of election systems designed to provide end-to-end verifiability and a high degree of transparency while ensuring secrecy of the ballot. Assurance for these systems arises from the auditability of the election itself, rather than the need to place trust in the sys...
متن کاملConstructing secret, verifiable auction schemes from election schemes
Auctions and elections are seemingly disjoint research fields. Nevertheless, we observe that similar cryptographic primitives are used in both fields. For instance, mixnets, homomorphic encryption, and trapdoor bitcommitments, have been used by state-of-the-art schemes in both fields. These developments have appeared independently. For example, the adoption of mixnets in elections preceded a si...
متن کاملA Verifiable Multi-Authority Secret Election Allowing Abstention from Voting
In this paper, we propose a robust and verifiable multi-authority secret voting scheme which meets the requirements of large-scale general elections. This scheme uses a uniquely blind threshold signature scheme to get blind threshold electronic votes such that any voter can abstain from voting after the registration phase. It also uses the threshold cryptosystem to guarantee fairness among the ...
متن کاملWhen every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Security & Privacy
سال: 2017
ISSN: 1540-7993
DOI: 10.1109/msp.2017.78